Relating Abstract Datatypes and Z-Schemata
نویسنده
چکیده
In this paper we investigate formally the relationship between the notion of abstract datatypes in an arbitrary institution, found in algebraic specification languages like Clear, ASL, and CASL; and the notion of schemata from the model-oriented specification language Z. To this end the institution S of the logic underlying Z is defined, and a translation of Z-schemata to abstract datatypes over S is given. The notion of a schema is internal to the logic of Z, and thus specification techniques of Z relying on the notion of a schema can only be applied in the context of Z. By translating Z-schemata to abstract datatypes, these specification techniques can be transformed to specification techniques using abstract datatypes. Since the notion of abstract datatypes is institution independent, this results in a separation of these specification techniques from the specification language Z and allows them to be applied in the context of other, e.g. algebraic, specification languages.
منابع مشابه
Providing Libraries of Algebraically Specified Datatypes in Z
This work was produced under the auspices of the SERC funded project GR/G49531. Z, Z Method, OBJ, Abstract Datatypes, Safety Critical Systems, Initiality Z is a rich and expressive speci cation language. It is possible to use Z to produce clear, abstract and elegant speci cations; it is also possible to use Z to produce meaningless speci cations. One of the overall aims of the research work in ...
متن کاملWeb Ontology Reasoning with Datatype Groups
When providing reasoning services for ontology languages such as DAML+OIL and OWL, it is necessary for description logics to deal with “concrete” datatypes (strings, integers, etc.) as well as “abstract” concepts and relationships. In this paper, we present a new approach, the datatype group approach, to integrating DLs with multiple datatypes. We discuss the advantages of such approach over th...
متن کاملUnfolding Abstract Datatypes
One of the most fundamental tools in the programmer’s toolbox is the abstract datatype. However, abstract datatypes are not as widely used in functional programming as they might be, perhaps because they are not subject to familiar proof methods such as equational reasoning and induction — in essence, because they are a form of codata rather than a form of data. We show that proof methods for c...
متن کاملRepresenting and Approximating Transfer Functions in Abstract Interpretation of Hetereogeneous Datatypes
We present a general method to combine different datatypes in Abstract Interpretation, within the framework of verification of reactive system. We focus more precisely on the efficient representation and approximation of the transfer functions involved in the abstract fixpoint computations. The solution we propose allows to tune smoothly the necessary tradeoff between accuracy and efficiency in...
متن کاملNASA / CR-97-206264 Abstract Datatypes in PVS
Datatypes in PVS Sam Owre and Natarajan Shankar SRI International, Menlo Park, California National Aeronautics and Space Administration Langley Research Center Hampton, Virginia 23681-2199 Prepared for Langley Research Center under contract NAS 1-18969
متن کامل